On tensor GMRES and Golub-Kahan methods via the T-product for color image processing

نویسندگان

چکیده

The present paper is concerned with developing tensor iterative Krylov subspace methods to solve large multi-linear equations. We use the T-product for two tensors define tubal global Arnoldi and Golub-Kahan bidiagonalization algorithms. Furthermore, we illustrate how tensor-based approaches can be exploited ill-posed problems arising from recovering blurry multichannel (color) images videos, using so-called Tikhonov regularization technique, provide computable approximate regularized solutions. also review a generalized cross-validation discrepancy principle type of criterion selection parameter in regularization. Applications image sequence processing are given demonstrate efficiency

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

GCV for Tikhonov regularization via global Golub-Kahan decomposition

Generalized Cross Validation (GCV) is a popular approach to determining the regularization parameter in Tikhonov regularization. The regularization parameter is chosen by minimizing an expression, which is easy to evaluate for small-scale problems, but prohibitively expensive to compute for large-scale ones. This paper describes a novel method, based on Gauss-type quadrature, for determining up...

متن کامل

The Combinational Use Of Knowledge-Based Methods and Morphological Image Processing in Color Image Face Detection

The human facial recognition is the base for all facial processing systems. In this work a basicmethod is presented for the reduction of detection time in fixed image with different color levels.The proposed method is the simplest approach in face spatial localization, since it doesn’trequire the dynamics of images and information of the color of skin in image background. Inaddition, to do face...

متن کامل

Generalized Golub-Kahan Bidiagonalization and Stopping Criteria

The Golub–Kahan bidiagonalization algorithm has been widely used in solving leastsquares problems and in the computation of the SVD of rectangular matrices. Here we propose an algorithm based on the Golub–Kahan process for the solution of augmented systems that minimizes the norm of the error and, in particular, we propose a novel estimator of the error similar to the one proposed by Hestenes a...

متن کامل

On the Lanczos and Golub-Kahan reduction methods applied to discrete ill-posed problems

The symmetric Lanczos method is commonly applied to reduce large-scale symmetric linear discrete ill-posed problems to small ones with a symmetric tridiagonal matrix. We investigate how quickly the nonnegative subdiagonal entries of this matrix decay to zero. Their fast decay to zero suggests that there is little benefit in expressing the solution of the discrete ill-posed problems in terms of ...

متن کامل

Reorthogonalization for the Golub-Kahan-Lanczos bidiagonal reduction

The Golub–Kahan–Lanczos (GKL) bidiagonal reduction generates, by recurrence, the matrix factorization of X ∈ Rm×n,m ≥ n, given by X = U BV T where U ∈ Rm×n is left orthogonal, V ∈ Rn×n is orthogonal, and B ∈ Rn×n is bidiagonal. When the GKL recurrence is implemented in finite precision arithmetic, the columns of U and V tend to lose orthogonality, making a reorthogonalization strategy necessary...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Journal of Linear Algebra

سال: 2021

ISSN: ['1081-3810', '1537-9582']

DOI: https://doi.org/10.13001/ela.2021.5471